Fast, Uniform Scalar Multiplication for Genus 2 Jacobians with Fast Kummers
نویسندگان
چکیده
We give oneand two-dimensional scalar multiplication algorithms for Jacobians of genus 2 curves that operate by projecting to Kummer surfaces, where we can exploit faster and more uniform pseudomultiplication, before recovering the proper “signed” output back on the Jacobian. This extends the work of López and Dahab, Okeya and Sakurai, and Brier and Joye to genus 2, and also to two-dimensional scalar multiplication. The technique is especially interesting in genus 2, because Kummer surfaces can outperform comparable elliptic curve systems.
منابع مشابه
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes
We give a general framework for uniform, constant-time oneand two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the xline or Kummer surface, where we can exploit faster and more uniform pseudomultiplication, before recovering the proper “signed” output back on the curve or Jacobian. This extends the work of López a...
متن کاملFast genus 2 arithmetic based on Theta functions
In 1986, D. V. Chudnovsky and G. V. Chudnovsky proposed to use formulae coming from Theta functions for the arithmetic in Jacobians of genus 2 curves. We follow this idea and derive fast formulae for the scalar multiplication in the Kummer surface associated to a genus 2 curve, using a Montgomery ladder. Our formulae can be used to design very efficient genus 2 cryptosystems that should be fast...
متن کاملFast arithmetic and pairing evaluation on genus 2 curves
We present two algorithms for fast arithmetic in Jacobians of genus 2 curves. The first speeds up the process of “double-and-add” by an estimated 5.5% over the standard algorithm. The second modifies the construction of the functions used to compute the Weil and Tate pairings in a way that saves 6 field multiplications per evaluation.
متن کاملSpeeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map
In [8] Koblitz suggested to make use of a Frobenius expansion to speed up the scalar multiplications in the Jacobians of hyperelliptic curves over the characteristic 2 field. Recently, Günther et. al.[6] have modified Koblitz’s Frobenius expansion method and applied it to the Koblitz curves of genus 2 over F2 to speed up the scalar multiplication. In this paper, we show that the method given in...
متن کاملHyper-and-elliptic-curve cryptography
This paper introduces “hyper-and-elliptic-curve cryptography”, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (e.g., Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (e.g., key generation) and multi-scalar m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016